PLSAV: Parallel loop searching and verifying for loop closure detection
نویسندگان
چکیده
منابع مشابه
Resultants and Loop Closure
The problem of tripeptide loop closure is formulated in terms of the angles { i}i 1 3 describing the orientation of each peptide unit about the virtual axis joining the C atoms. Imposing the constraint that at the junction of two such units the bond angle between the bonds C ON and C OC is fixed at some prescribed value results in a system of three bivariate polynomials in ui : tan i/2 of degre...
متن کاملLoop Detection in Prolog by Searching for Primitive Cyclic Goals
A new method will be proposed for the detection of some loops during depth-first search in Prolog, and an implementation of this method will be described. The method is a modification of another one presented in the paper [3]. As in [3], we shall consider only Prolog programs consisting of Horn clauses and goals consisting of atomic formulas. The new method has the following advantage: only the...
متن کاملMILD: Multi-Index hashing for Loop closure Detection
Loop Closure Detection (LCD) has been proved to be extremely useful in global consistent visual Simultaneously Localization and Mapping (SLAM) and appearance-based robot relocalization. Methods exploiting binary features in bag of words representation have recently gained a lot of popularity for their efficiency, but suffer from low recall due to the inherent drawback that high dimensional bina...
متن کاملOriginal Loop-Closure Detection Algorithm for Monocular vSLAM
Vision-based simultaneous localization and mapping (vSLAM) is a well-established problem in mobile robotics and monocular vSLAM is one of the most challenging variations of that problem nowadays. In this work we study one of the core post-processing optimization mechanisms in vSLAM, e.g. loop-closure detection. We analyze the existing methods and propose original algorithm for loop-closure dete...
متن کاملEnsemble of Bayesian Filters for Loop Closure Detection
Loop closure detection for visual only simultaneous localization and mapping needs effective feature descriptors to obtain good performance results. Currently, the most widely used feature description is the global or local descriptor such as color histogram and Speeded Up Robust Features. The global features can be computed either by considering all points within a region, or only for those po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Intelligent Transport Systems
سال: 2021
ISSN: 1751-956X,1751-9578
DOI: 10.1049/itr2.12054